Closed convex invariant subsets of $L\sb{p}(G)$
نویسندگان
چکیده
منابع مشابه
Minimum recession-compatible subsets of closed convex sets
A subset B of a closed convex set A is recession-compatible with respect to A if A can be expressed as the Minkowski sum of B and the recession cone of A. We show that if A contains no line, then there exists a recession-compatible subset of A that is minimum with respect to set inclusion. The proof only uses basic facts of convex analysis and does not depend on Zorn’s Lemma. An application of ...
متن کاملSOME REMARKS ON GENERALIZATIONS OF MULTIPLICATIVELY CLOSED SUBSETS
Let R be a commutative ring with identity and Mbe a unitary R-module. In this paper we generalize the conceptmultiplicatively closed subset of R and we study some propertiesof these genaralized subsets of M. Among the many results in thispaper, we generalize some well-known theorems about multiplicativelyclosed subsets of R to these generalized subsets of M. Alsowe show that some other well-kno...
متن کاملModeling Poset Convex Subsets
A subset S of a poset (partially ordered set) is convex if and only if S contains every poset element which is between any two elements in S. Poset convex subsets arise in applications that involve precedence constraints, such as in project scheduling, production planning, and assembly line balancing. We give a strongly polynomial time algorithm which, given a poset and element weights (of arbi...
متن کاملOn Convex Subsets in Tournaments
A tournament is a complete directed graph. A convex subset is a vertex subset with the property that every two-path beginning and ending inside the convex subset is contained completely within the subset. This paper shows that every nontrivial convex subset is the closure of a subset of vertices of cardinality two. This result leads to algorithms that nd all convex subsets in a tournament in O(...
متن کاملIntervals in Lattices of -Meet-Closed Subsets
We study abstract properties of intervals in the complete lattice of all meet-closed subsets ( -subsemilattices) of a -(meet-)semilattice S, where is an arbitrary cardinal number. Any interval of that kind is an extremally detachable closure system (that is, for each closed set A and each point x outside A, deleting x from the closed set generated by A and x leaves a closed set). Such closure s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1977
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1977-0477604-5